Sequence of maximal distance codes in graphs or other metric spaces
نویسنده
چکیده
Given a subset C in a metric space E, its successor is the subset s(C) of points at maximum distance from C in E. We study some properties of the sequence obtained by iterating this operation. Graphs with their usual distance provide already typical examples.
منابع مشابه
Common fixed points for a pair of mappings in $b$-Metric spaces via digraphs and altering distance functions
In this paper, we discuss the existence and uniqueness of points of coincidence and common fixed points for a pair of self-mappings satisfying some generalized contractive type conditions in $b$-metric spaces endowed with graphs and altering distance functions. Finally, some examples are provided to justify the validity of our results.
متن کاملCommon fixed point theorems of contractive mappings sequence in partially ordered G-metric spaces
We consider the concept of Ω-distance on a complete partially ordered G-metric space and prove some common fixed point theorems.
متن کاملA CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION
The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$. In this case, $B$ is called a textit{metric basis} for $G$. The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$. Givi...
متن کاملExtended graphs based on KM-fuzzy metric spaces
This paper, applies the concept of KM-fuzzy metric spaces and introduces a novel concept of KM-fuzzy metric graphs based on KM-fuzzy metric spaces. This study, investigates the finite KM-fuzzy metric spaces with respect to metrics and KM-fuzzy metrics and constructs KM-fuzzy metric spaces on any given non-empty sets. It tries to extend the concept of KM-fuzzy metric spaces to a larger ...
متن کاملA Brief Survey of Metrics in Coding Theory
The main objects of Coding theory are metric vector or matrix spaces. Subsets of spaces are known as codes. The main problem is constructing codes of given pairwise distance and having maximal cardinality. Most known and most investigated spaces are Hamming spaces. Thousands papers and books are devoted to codes in the Hamming metric. We mention here only two books [1; 2] and will not consider ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- EJGTA
دوره 1 شماره
صفحات -
تاریخ انتشار 2013